Execution Trace Analysis Using LTL-FO ^+

نویسندگان

  • Raphaël Khoury
  • Sylvain Hallé
  • Omar Waldmann
چکیده

We explore of use of the tool BeepBeep, a monitor for the temporal logic LTL-FO+, in interpreting assembly traces, focusing on security-related applications. LTL-FO+ is an extension of LTL, which includes first order quantification. We show that LTL-FO+ is a sufficiently expressive formalism to state a number of interesting program behaviors, and demonstrate experimentally that BeepBeep can efficiently verify the validity of the properties on assembly traces in tractable time.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

XML Methods for Validation of Temporal Properties on Message Traces with Data

We perform trace validation of LTL formulæ by exclusively using readily-available XML technologies. We first provide a translation between LTL and a subset of the XML Query Language XQuery, and show that an efficient validation of LTL formulæ can be achieved through the evaluation of XQuery expressions. Moreover, since LTL maps to a small fragment of XQuery, we show that that extending it to LT...

متن کامل

Synthesizing Dynamic Programming Algorithms from Linear Temporal Logic Formulae

The problem of testing a linear temporal logic (LTL) formula on a finite execution trace of events, generated by an executing program, occurs naturally in runtime analysis of software. We present an algorithm which takes an LTL formula and generates an efficient dynamic programming algorithm. The generated algorithm tests whether the LTL formula is satisfied by a finite trace of events given as...

متن کامل

Testing Linear Temporal Logic Formulae on Finite Execution Traces

We present an algorithm for e ciently testing Linear Temporal Logic (LTL) formulae on nite execution traces. The standard models of LTL are in nite traces, re ecting the behavior of reactive and concurrent systems which conceptually may be continuously alive. In most past applications of LTL, theorem provers and model checkers have been used to formally prove that down-scaled models satisfy suc...

متن کامل

Runtime Enforcement of First-Order LTL Properties on Data-Aware Business Processes

This paper studies the following problem: given a relational data schema, a temporal property over the schema, and a process that modifies the data instances, how can we enforce the property during each step of the process execution? Temporal properties are defined using a first-order future time LTL (FO-LTL) and they are evaluated under finite and fixed domain assumptions. Under such restricti...

متن کامل

Monitoring Execution Traces using Metric Alternating Automata

We present an automata based verification framework to monitor a running system against a high level specification. Our framework includes specification formalisms to express system properties and verification algorithms to check an execution trace of a system against the intended behavior. Linear Temporal Logic (LTL) is a widely used specification language to express temporal properties of a s...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2016